Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks

A unit disk graph and its proximity graphs are often used as the underlying topologies of a mobile ad hoc network. One category of unicast routing algorithms, position-based routing algorithms, has been developed and studied extensively in the context of 2-D. This, however, poses evident questions in terms of the reliability and efficiency of these algorithms when practically the mobile host is an object positioned in the real world of 3-D. We propose a heuristic for routing in 3-D based on the 2-D face routing algorithm. We study experimentally the properties of geometric graphs in 3-D and the performance of various routing algorithms on these graphs.